On the 2-abelian complexity of the Thue-Morse word
نویسنده
چکیده
We show that the 2-abelian complexity of the infinite Thue–Morse word is 2-regular, and other properties of the 2-abelian complexity, most notably that it is a concatenation of palindromes of increasing length. We also show sharp bounds for the length of unique extensions of factors of size n, occurring in the Thue–Morse word.
منابع مشابه
Some Properties of Abelian Return Words
We investigate some properties of abelian return words as recently introduced by Puzynina and Zamboni. In particular, we obtain a characterization of Sturmian words with nonzero intercept in terms of the finiteness of the set of abelian return words to all prefixes. We describe this set of abelian returns for the Fibonacci word but also for the 2-automatic Thue–Morse word. We also investigate t...
متن کاملA new approach to the $2$-regularity of the l-abelian complexity of 2-automatic sequences
We prove that a sequence satisfying a certain symmetry property is 2-regular in the sense of Allouche and Shallit, i.e., the Z-module generated by its 2-kernel is finitely generated. We apply this theorem to develop a general approach for studying the l-abelian complexity of 2-automatic sequences. In particular, we prove that the period-doubling word and the Thue–Morse word have 2-abelian compl...
متن کاملA New Approach to the 2-Regularity of the ℓ-Abelian Complexity of 2-Automatic Sequences
We prove that a sequence satisfying a certain symmetry property is 2-regular in the sense of Allouche and Shallit, i.e., the Z-module generated by its 2-kernel is finitely generated. We apply this theorem to develop a general approach for studying the `-abelian complexity of 2-automatic sequences. In particular, we prove that the period-doubling word and the Thue–Morse word have 2-abelian compl...
متن کاملAbelian Properties of Words
We say that two finite words u and v are abelian equivalent if and only if they have the same number of occurrences of each letter, or equivalently if they define the same Parikh vector. In this paper we investigate various abelian properties of words including abelian complexity, and abelian powers. We study the abelian complexity of the Thue-Morse word and the Tribonacci word, and answer an o...
متن کاملAnother Generalization of Abelian Equivalence: Binomial Complexity of Infinite Words
The binomial coefficient of two words u and v is the number of times v occurs as a subsequence of u. Based on this classical notion, we introduce the mbinomial equivalence of two words refining the abelian equivalence. Two words x and y are m-binomially equivalent, if, for all words v of length at most m, the binomial coefficients of x and v and respectively, y and v are equal. The m-binomial c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Theor. Comput. Sci.
دوره 593 شماره
صفحات -
تاریخ انتشار 2015